skip to main content
research-article

Performance Modelling and Analysis of Software-Defined Networking under Bursty Multimedia Traffic

Authors Info & Claims
Published:21 September 2016Publication History
Skip Abstract Section

Abstract

Software-Defined Networking (SDN) is an emerging architecture for the next-generation Internet, providing unprecedented network programmability to handle the explosive growth of big data driven by the popularisation of smart mobile devices and the pervasiveness of content-rich multimedia applications. In order to quantitatively investigate the performance characteristics of SDN networks, several research efforts from both simulation experiments and analytical modelling have been reported in the current literature. Among those studies, analytical modelling has demonstrated its superiority in terms of cost-effectiveness in the evaluation of large-scale networks. However, for analytical tractability and simplification, existing analytical models are derived based on the unrealistic assumptions that the network traffic follows the Poisson process, which is suitable to model nonbursty text data, and the data plane of SDN is modelled by one simplified Single-Server Single-Queue (SSSQ) system. Recent measurement studies have shown that, due to the features of heavy volume and high velocity, the multimedia big data generated by real-world multimedia applications reveals the bursty and correlated nature in the network transmission. With the aim of capturing such features of realistic traffic patterns and obtaining a comprehensive and deeper understanding of the performance behaviour of SDN networks, this article presents a new analytical model to investigate the performance of SDN in the presence of the bursty and correlated arrivals modelled by the Markov Modulated Poisson Process (MMPP). The Quality-of-Service performance metrics in terms of the average latency and average network throughput of the SDN networks are derived based on the developed analytical model. To consider a realistic multiqueue system of forwarding elements, a Priority-Queue (PQ) system is adopted to model the SDN data plane. To address the challenging problem of obtaining the key performance metrics, for example, queue-length distribution of a PQ system with a given service capacity, a versatile methodology extending the Empty Buffer Approximation (EBA) method is proposed to facilitate the decomposition of such a PQ system to two SSSQ systems. The validity of the proposed model is demonstrated through extensive simulation experiments. To illustrate its application, the developed model is then utilised to study the strategy of the network configuration and resource allocation in SDN networks.

References

  1. Jemal H. Abawajy. 2009. An efficient adaptive scheduling policy for high-performance computing. Future Generation Computer Systems 25, 3, 364--370. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Gianni Antichi, Andrea Di Pietro, Stefano Giordano, Gregorio Procissi, and Domenico Ficara. 2011. Design and development of an OpenFlow compliant smart gigabit switch. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM’11). 1--5.Google ScholarGoogle ScholarCross RefCross Ref
  3. Siamak Azodolmolky, Reza Nejabati, Maryam Pazouki, Philipp Wieder, Ramin Yahyapour, and Dimitra Simeonidou. 2013. An analytical model for software defined networking: A network calculus-based approach. In Proceedings of the IEEE Global Communications Conference (GLOBECOM’13). 1397--1402.Google ScholarGoogle ScholarCross RefCross Ref
  4. Pall Beck, Peter Clemens, Santiago Freitas, Jeff Gatz, Michele Girola, Jason Gmitter, Holger Mueller, Ray O’Hanlon, Veerendra Para, Joe Robinson, Andy Sholomon, Jason Walker, and Jon Tate. 2013. IBM and Cisco: Together for a World Class Data Center. IBM Redbooks publication. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Andrea Bianco, Robert Birke, Luca Giraudo, and Manuel Palacin. 2010. OpenFlow switching: Data plane performance. In Proceedings of the IEEE International Conference on Communications (ICC’10). 1--5.Google ScholarGoogle ScholarCross RefCross Ref
  6. Mosharaf Chowdhury, Matei Zaharia, Justin Ma, Michael I. Jordan, and Ion Stoica. 2011. Managing data transfers in computer clusters with orchestra. ACM SIGCOMM Computer Communication Review 41, 4, 98--109. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cisco. 2016. Visual Networking Index: Forecast and Methodology, 2015--2020. http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/complete-white-paper-c11-481360.html.Google ScholarGoogle Scholar
  8. Paul T. Congdon, Prasant Mohapatra, Matthew Farrens, and Venkatesh Akella. 2014. Simultaneously reducing latency and power consumption in OpenFlow switches. IEEE/ACM Transactions on Networking 22, 3, 1007--1020. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Anupam Das, Cristian Lumezanu, Yueping Zhang, Vishal Singh, Guofei Jiang, and Curtis Yu. 2013. Transparent and flexible network management for big data processing in the cloud. In Proceedings of the 5th USENIX Workshop on Hot Topics in Cloud Computing. 1--6.Google ScholarGoogle Scholar
  10. Mianxiong Dong, He Li, Kaoru Ota, and Jiang Xiao. 2015. Rule caching in SDN-enabled mobile access networks. IEEE Network 29, 4, 40--45.Google ScholarGoogle ScholarCross RefCross Ref
  11. Shuo Fang, Yang Yu, Chuan Heng Foh, and Khin Mi Mi Aung. 2013. A loss-free multipathing solution for data center network using software-defined networking approach. IEEE Transactions on Magnetics 49, 6, 2723--2730.Google ScholarGoogle ScholarCross RefCross Ref
  12. Huei-Wen Ferng and Jin-Fu Chang. 2000. Connection-wise end-to-end delay analysis in ATM networks. IEICE Transactions on Communications 83, 3, 659--671.Google ScholarGoogle Scholar
  13. Huei-Wen Ferng and Jin-Fu Chang. 2001. Departure processes of BMAP/G/1 queues. Queueing Systems Theory and Applications 39, 2/3, 109--135. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wolfgang Fischer and Kathleen Meier-Hellstern. 1993. The Markov-modulated Poisson process (MMPP) cookbook. Performance Evaluation 18, 2, 149--171. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Peixia Gao, Sabine Wittevrongel, Koenraad Laevens, Danny Vleeschauwer, and Herwig Bruneel. 2010. Distributional Little’s law for queues with heterogeneous server interruptions. Electronics Letters 46, 11, 763--764.Google ScholarGoogle ScholarCross RefCross Ref
  16. H. Heffes. 1980. A class of data traffic processes-covariance function characterization and related queuing results. Bell System Technical Journal 59, 6, 897--929.Google ScholarGoogle ScholarCross RefCross Ref
  17. Han Hu, Yonggang Wen, Yue Gao, Tat-Seng Chua, and Xuelong Li. 2015. Toward an SDN-enabled big data platform for social TV analytics. IEEE Network 29, 5, 43--49.Google ScholarGoogle ScholarCross RefCross Ref
  18. Michael Jarschel, Simon Oechsner, Daniel Schlosser, Rastin Pries, Sebastian Goll, and Phuoc Tran-Gia. 2011. Modeling and performance evaluation of an OpenFlow architecture. In Proceedings of the 23rd International Teletraffic Congress (ITC’11). 1--7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Xiaolong Jin and Geyong Min. 2009. Modelling and analysis of priority queueing systems with multi-class self-similar network traffic: A novel and efficient queue-decomposition approach. IEEE Transactions on Communications 57, 5, 1444--1452. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Rishi Kapoor, Alex C. Snoeren, Geoffrey M. Voelker, and George Porter. 2013. Bullet trains: A study of NIC burst behavior at microsecond timescales. In Proceedings of the 9th ACM Conference on Emerging Networking Experiments and Technologies (CoNEXT’13). 133--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Asif Khan and Nirav Dave. 2013. Enabling hardware exploration in software-defined networking: A flexible, portable OpenFlow switch. In Proceedings of the IEEE Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM’13). IEEE, 145--148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Xiangxin Kong, Zhiliang Wang, Xingang Shi, and Xia Yin. 2013. Performance evaluation of software-defined networking with real-life ISP traffic. In Proceedings of the IEEE Symposium on Computers and Communications (ISCC’13). 541--547.Google ScholarGoogle Scholar
  23. Howon Lee and DongHo Cho. 2010. Capacity improvement and analysis of VoIP service in a cognitive radio system. IEEE Transactions on Vehicular Technology 59, 4, 1646--1651.Google ScholarGoogle ScholarCross RefCross Ref
  24. He Li, Mianxiong Dong, Xiaofei Liao, and Hai Jin. 2014. Deduplication-based energy efficient deduplication-based energy efficient storage system in cloud environment. Computer Journal 1--11.Google ScholarGoogle Scholar
  25. He Li, Mianxiong Dong, and Kaoru Ota. 2015. Radio access network virtualization for the social Internet of Things. IEEE Cloud Computing 2, 6, 42--50.Google ScholarGoogle ScholarCross RefCross Ref
  26. Kuanghao Liu, Xinhua Ling, Xuemin Shen, and Jon W. Mark. 2008. Performance analysis of prioritized MAC in UWB WPAN with bursty multimedia traffic. IEEE Transactions on Vehicular Technology 57, 4, 2462--2473.Google ScholarGoogle ScholarCross RefCross Ref
  27. Lei Liu, Xiaolong Jin, Geyong Min, and Keqiu Li. 2009. An analytical model of deficit round robin scheduling mechanism under self- similar traffic. In Proceedings of the IEEE International Conference on Scalable Computing and Communications. 319--324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Zhi Liu, Xiang Wang, Weishen Pan, Baohua Yang, Xiaohe Hu, and Jun Li. 2015. Towards efficient load distribution in big data cloud. In Proceedings of the International Conference on Computing, Networking and Communications (ICNC’15). 117--122.Google ScholarGoogle ScholarCross RefCross Ref
  29. Kashif Mahmood, Ameen Chilwan, Olav Østerbø, and Michael Jarschel. 2015. Modelling of OpenFlow-based software-defined networks: The multiple node case. IET Networks 4, 5, 278--284.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Petteri Mannersalo and Ilkka Norros. 2002. A most probable path approach to queueing systems with general Gaussian input. Computer Networks 40, 3, 399--412. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Brian L. Mark and Yariv Ephraim. 2014. Explicit causal recursive estimators for continuous-time bivariate Markov chains. IEEE Transactions on Signal Processing 62, 10, 2709--2718. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Wang Miao, Geyong Min, Yulei Wu, and Haozhe Wang. 2015. Performance modelling of preemption-based packet scheduling for data plane in software defined networks. In Proceedings of the IEEE International Conference on Smart City. 60--65.Google ScholarGoogle ScholarCross RefCross Ref
  33. Jad Naous, David Erickson, G. Adam Covington, Guido Appenzeller, and Nick McKeown. 2008. Implementing an OpenFlow switch on the NetFPGA platform. In Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. 1--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. OMNet++. 2011. OMNeT++ Network Simulator. Retrieved September 3, 2016 from http://www.omnetpp.org/.Google ScholarGoogle Scholar
  35. ONF. 2012. Software-Defined Networking: The New Norm for Networks. Technical Report. Open Network Foundation. Retrieved September 3, 2016 from https://www.opennetworking.org/.Google ScholarGoogle Scholar
  36. ONF. 2013. OpenFlow Switch Specification Version 1.3.3. Technical Report. Open Network Foundation. Retrieved September 3, 2016 from www.opennetworking.org/.Google ScholarGoogle Scholar
  37. Peng Qin, Bin Dai, Benxiong Huang, and Guan Xu. 2015. Bandwidth-aware scheduling with SDN in hadoop: A new trend for big data. IEEE Systems Journal 1--8.Google ScholarGoogle Scholar
  38. Pethuru Raj, Anupama Raman, Dhivya Nagaraj, and Siddhartha Duggirala. 2015. High-Performance Big-Data Analytics. Springer International Publishing. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Abhinava Sadasivarao, Sharfuddin Syed, Ping Pan, Chris Liou, Inder Monga, Chin Guok, and Andrew Lake. 2013. Bursting data between data centers: Case for transport SDN. In Proceedings of the IEEE Annual Symposium on High-Performance Interconnects (HOTI’13). 87--90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Guohui Wang, T. S. Eugene Ng, and Anees Shaikh. 2012. Programming your network at run-time for big data applications. In Proceedings of the 1st Workshop on Hot Topics in Software Defined Networks. 103--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Yulei Wu, Geyong Min, and Laurence T. Yang. 2013. Performance analysis of hybrid wireless networks under bursty and correlated traffic. IEEE Transactions on Vehicular Technology 62, 1, 449--454.Google ScholarGoogle ScholarCross RefCross Ref
  42. Soheil Hassas Yeganeh, Amin Tootoonchian, and Yashar Ganjali. 2013. On scalability of software-defined networking. IEEE Communications Magazine 51, 2, 136--141.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Performance Modelling and Analysis of Software-Defined Networking under Bursty Multimedia Traffic

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Multimedia Computing, Communications, and Applications
        ACM Transactions on Multimedia Computing, Communications, and Applications  Volume 12, Issue 5s
        Special Section on Multimedia Big Data: Networking and Special Section on Best Papers From ACM MMSYS/NOSSDAV 2015
        December 2016
        288 pages
        ISSN:1551-6857
        EISSN:1551-6865
        DOI:10.1145/3001754
        Issue’s Table of Contents

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 21 September 2016
        • Revised: 1 April 2016
        • Accepted: 1 April 2016
        • Received: 1 December 2015
        Published in tomm Volume 12, Issue 5s

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader